Enhancing FP-Growth Performance Using Multi-threading based on Comparative Study
نویسندگان
چکیده
منابع مشابه
Multi-Threading Performance on Commodity Multi-Core Processors
Multi-core processors based commodity servers recently become building blocks for high performance computing Linux clusters. The multi-core processors deliver better performance-to-cost ratios relative to their single-core predecessors through on-chip multi-threading. However, they present challenges in developing high performance multi-threaded code. In this paper we study the performance of d...
متن کاملIncreasing Performance through Software Multi-threading
No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning or otherwise, except as permitted under Sections 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Analysis of the impact of multi-threading on communication performance
Although processor become massively multicore and by the way, applications multithreaded, the issue of multithreading in the current communication libraries is still neglected. Most of them content themselves with supporting concurrent flows thanks to coarse-grain locking but do not manage them in a parallel. In this paper, we firstly present how to refine the locking feature in order to perfor...
متن کاملMS-FP-Growth: A multi-support Vrsion of FP-Growth Agorithm
In this paper, we propose a new version of FP-Growth algorithm to find association rules. In this version, we vary the minsup value from one level to another. This variation is made in two cases: increasing and decreasing the minsup value. We performed a set of experiments to validate the usefulness of our proposition in the generation of association rules process.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Computing Research
سال: 2015
ISSN: 2042-4655
DOI: 10.20533/ijicr.2042.4655.2015.0076